Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
نویسندگان
چکیده
منابع مشابه
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
Abstract. We present a Branch-and-Cut algorithm where the volume algorithm is applied instead of the traditionally used dual simplex algorithm to the linear programming relaxations in the root node of the search tree. This means that we use fast approximate solutions to these linear programs instead of exact but slower solutions. We present computational results with the Steiner tree and Max-Cu...
متن کاملA branch and cut algorithm for the Steiner problem in graphs
In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraints given previously in the literature. We strengthen this SST formulation and present a branch and...
متن کاملMax-cut in circulant graphs
Poljak, S. and D. Turzik, Max-cut in circulant graphs, Discrete Mathematics 108 (1992) 379-392. We study the max-cut problem in circulant graphs C,,,, where C,,, is a graph whose edge set consists of a cycle of length n and all the vertex pairs of distance r on the cycle. An efficient solution of the problem is obtained so that we show that there is always a maximum cut of a particular shape, c...
متن کاملA Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
In this paper we present a method for finding exact solutions of the Max-Cut problem maxxLx such that x ∈ {±1}. We use a semidefinite relaxation combined with triangle inequalities, which we solve with the bundle method. This approach is due to Fischer, Gruber, Rendl, and Sotirov [12] and uses Lagrangian duality to get upper bounds with reasonable computational effort. The expensive part of our...
متن کاملOn max cut in cubic graphs
This paper is concerned with the maximum cut problem in parallel on cubic graphs. New theoretical results characterizing the cardinality of the cut are presented. These results make it possible to design a simple combinatorial O(log n) time parallel algorithm , running on a CRCW PRAM with O(n) processors. The approximation ratio achieved by the algorithm is 1: 3 and improves the best known para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2006
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2006010